Presentation Theorems for Coded Character Sets

نویسنده

  • Dele Oluwade
چکیده

The notion of ’presentation’, as used in combinatorial group theory, is applied to coded character sets(CCSs) − sets which facilitate the interchange of messages in a digital computer network(DCN) . By grouping each element of the set into two portions and using the idea of group presentation( whereby a group is specified by its set of generators and its set of relators) , the presentation of a CCS is described. This is illustrated using the Extended Binary Coded Decimal Interchange Code(EBCDIC) which is one of the most popular CCSs in DCNs.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Character Processing Based on Character Ontology

We use characters as a basis for data representation in computers, and as a tool for communication over computer networks. Computer programs are made of characters, we exchange mails that are sequences of characters, and many of the contents available over the Internet are realized in the form of characters. Currently, in the field of information processing, characters are defined and shared us...

متن کامل

Fixed point theorems for $alpha$-$psi$-contractive mappings in partially ordered sets and application to ordinary differential equations

‎In this paper‎, ‎we introduce $alpha$-$psi$-contractive mapping in partially ordered sets and construct fixed point theorems to solve a first-order ordinary differential equation by existence of its lower solution.

متن کامل

Character representation

Computer character sets are not adequate for encoding texts any language, even in modern English. In all likelihood this will remain the case for some time to come, though a major improvement in the situation is approaching with the implementation of the new ISO 10646 universal coded character set. Because of the present limitations, the standards committee which drew up SGML included one type ...

متن کامل

Common Fixed-Point Theorems For Generalized Fuzzy Contraction Mapping

In this paper we investigate common xed point theorems for contraction mapping in fuzzy metric space introduced by Gregori and Sapena [V. Gregori, A. Sapena, On xed-point the- orems in fuzzy metric spaces, Fuzzy Sets and Systems, 125 (2002), 245-252].

متن کامل

A survey of Unicode compression

The Unicode (ISO/IEC 10646) coded character set is the largest of its kind.1 Almost a million code positions are available in Unicode for formal character encoding, with more than 137,000 additional code positions reserved for private-use characters. This is quite a change from the 128 or 256 characters available in 8-bit “legacy” code pages, or even the thousands available in East Asian double...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/cs/0610168  شماره 

صفحات  -

تاریخ انتشار 2006